Roots and Irreducible Polynomials
نویسنده
چکیده
This handout, which accompanies the course on analogies between Z and F [T ], discusses some properties of polynomials in F [T ]. The results in Sections 1 and 2 work with any F , but the results in Section 3 and 4 are (somewhat) special to the field F = Fp. The main result in these notes in Theorem 3.7. The notation F [T ]h(T ), for the ring of polynomials in F [T ] considered modulo h(T ), is used on the first-year number theory sets. We will instead use a more common notation from abstract algebra, and write F [T ]/h(T ) for F [T ]h(T ). As a matter of terminology, when f(T ) ∈ F [T ], we will say f(T ) is a polynomial “over” F . For example, if we are thinking about T 3 +2T +1 as a polynomial in F5[T ] (as opposed to F2[T ], R[T ], and so on), we might say “consider T 3 + 2T + 1 over F5.”
منابع مشابه
Computing Roots of Polynomials over Function Fields of Curves
We design algorithms for nding roots of polynomials over function elds of curves. Such algorithms are useful for list decoding of Reed-Solomon and algebraic-geometric codes. In the rst half of the paper we will focus on bivariate polynomials, i.e., polynomials over the coordinate ring of the aane line. In the second half we will design algorithms for computing roots of polynomials over the func...
متن کاملRoots of Irreducible Polynomials in Tame Henselian Extension Fields
A class of irreducible polynomials P over a valued field (F, v) is introduced, which is the set of all monic irreducible polynomials over F when (F, v) is maximally complete. A “best–possible” criterion is given for when the existence of an approximate root in a tamely ramified Henselian extension K of F to a polynomial f in P guarantees the existence of an exact root of f in K. §
متن کاملIterated constructions of irreducible polynomials over finite fields with linearly independent roots
The paper is devoted to constructive theory of synthesis of irreducible polynomials and irreducible N-polynomials (with linearly independent roots) over finite fields. For a suitably chosen initial N-polynomial F1ðxÞAF2s 1⁄2x of degree n; polynomials FkðxÞAF2s 1⁄2x of degrees 2 n are constructed by iteration of the transformation of variable x-x þ dx ; where dAF2s and da0: It is shown that the ...
متن کاملProducts Of Quadratic Polynomials With Roots Modulo Any Integer
We classify products of three quadratic polynomials, each irreducible over Q, which are solvable modulo m for every integer m > 1 but have no roots over the rational numbers. Polynomials with this property are known as intersective polynomials. We use Hensel’s Lemma and a refined version of Hensel’s Lemma to complete the proof. Mathematics Subject Classification: 11R09
متن کاملRoots and Irreducibles
This handout discusses relationships between roots of irreducible polynomials and field extensions. Throughout, the letters K, L, and F are fields and Fp = Z/(p) is the field of p elements. When f(X) ∈ K[X], we will say f(X) is a polynomial “over” K. Sections 2 and 3 describe some general features of roots of polynomials. In the later sections we look at roots to polynomials over the finite fie...
متن کاملPolynomials over Finite Fields and Applications
Self-reciprocal irreducible monic (srim) polynomials over finite fields have been studied in the past. These polynomials can be studied in the context of quadratic transformation of irreducible polynomials over finite fields. In this talk we present the generalization of some of the results known about srim polynomials to polynomials obtained by quadratic transformation of irreducible polynomia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003